Methods for nesting rank 3 normalized matching rank-unimodal posets
نویسندگان
چکیده
منابع مشابه
Some Sufficient Conditions for Finding a Nesting of the Normalized Matching Posets of Rank 3
Given a graded poset P , consider a chain decomposition C of P . If |C1| ≤ |C2| implies that the set of the ranks of elements in C1 is a subset of the ranks of elements in C2 for any chains C1, C2 ∈ C, then we say C is a nested chain decomposition (or nesting, for short) of P , and P is said to be nested. In 1970s, Griggs conjectured that every normalized matching rank-unimodal poset is nested....
متن کاملCOUNTING DISTINCT FUZZY SUBGROUPS OF SOME RANK-3 ABELIAN GROUPS
In this paper we classify fuzzy subgroups of a rank-3 abelian group $G = mathbb{Z}_{p^n} + mathbb{Z}_p + mathbb{Z}_p$ for any fixed prime $p$ and any positive integer $n$, using a natural equivalence relation given in cite{mur:01}. We present and prove explicit polynomial formulae for the number of (i) subgroups, (ii) maximal chains of subgroups, (iii) distinct fuzzy subgroups, (iv) non-isomorp...
متن کاملHigher rank Einstein solvmanifolds
In this paper we study the structure of standard Einstein solvmanifolds of arbitrary rank. Also the validity of a variational method for finding standard Einstein solvmanifolds is proved.
متن کاملApproximately Sampling Elements with Fixed Rank in Graded Posets
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often #Pcomplete, so we consider approximation algorithms for counting and uniform sampling. We show that for certain classes of posets, biased Markov chains that walk along edges of their Hasse diagrams allow us to approximately genera...
متن کاملLecture 3 — Page Rank 1 Calculating Page Rank
The combination of the bag-of-words representation, cosine distance, and inverse document frequency weighting forms the core of lots of information retrieval systems, because it works pretty well. However, there is more information in and about many documents than just this, and that too can be exploited in search. Today's lecture is about one of the most successful of these, which is to use li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.07.013